Bust-a-Move/Puzzle Bobble Is NP-complete
نویسندگان
چکیده
We prove that the classic 1994 Taito video game, known as Puzzle Bobble or Bust-a-Move, is NP-complete. Our proof applies to the perfect-information version where the bubble sequence is known in advance, and it uses just three bubble colors. “A girl runs up with somethin’ to prove. So don’t just stand there. Bust a move!” — Young MC [YDD89]
منابع مشابه
Solitaire Chess is NP-complete
Solitaire Chess” is a logic puzzle published by ThinkfunTM that can be seen as a single person version of traditional chess. Given a chess board with some chess pieces of the same color placed on it, the task is to capture all pieces but one using only moves that are allowed in chess. Moreover, in each move one piece has to be captured. We prove that deciding if a given instance of Solitaire Ch...
متن کاملSpiral Galaxies Puzzles are NP-complete
We will show that the question of whether or not a given Spiral Galaxies puzzle has a solution is NP-complete. To do so, we construct Spiral Galaxies puzzles which correspond to arbitrary Boolean circuits. A circuit will be satisfied, (that is, have a set of inputs which give the desired outputs) if and only if the corresponding puzzle has a solution. Since Satisfiability is the canonical NP-co...
متن کاملOn The NP-Completeness of The Nurikabe Pencil Puzzle and Variants Thereof
We show that the popular pencil puzzle Nurikabe is intractable from the computational complexity point of view, i.e., is NP-complete, even when the involved numbers are 1 and 2 only. To this end we show how to simulate Boolean gates by the puzzle under consideration. Moreover, we also study some Nurikabe variants, which remain NP-complete, too.
متن کاملMastermind is NP-Complete
In this paper we show that the Mastermind Satisfiability Problem (MSP) is NPcomplete. Mastermind is a popular game which can be turned into a logical puzzle called the Mastermind Satisfiability Problem in a similar spirit to the Minesweeper puzzle [5]. By proving that MSP is NP-complete, we reveal its intrinsic computational property that makes it challenging and interesting. This serves as an ...
متن کاملThe Three-Color and Two-Color Tantrix Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions
Holzer and Holzer [HH04] proved the Tantrix rotation puzzle problem with four colors NP-complete. Baumeister and Rothe [BR07] modified their construction to achieve a parsimonious reduction from satisfiability to this problem. Since parsimonious reductions preserve the number of solutions, it follows that the unique version of the four-color Tantrix rotation puzzle problem is DP-complete under ...
متن کامل